A man X has 7 friends,4 of them are ladies an | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(B) Let $L_X = 4, M_X = 3$ be the number of lady and man friends of $X$,and $L_Y = 3, M_Y = 4$ be the number of lady and man friends of $Y$.We need to

Vedclass · Accepted Answer

$485$

Vedclass · Answer

(B) Let $L_X = 4, M_X = 3$ be the number of lady and man friends of $X$,and $L_Y = 3, M_Y = 4$ be the number of lady and man friends of $Y$.We need to select $3$ ladies and $3$ men in total,such that $3$ friends are chosen from $X$'s group and $3$ friends are chosen from $Y$'s group.Let $X$ invite $l_1$ ladies and $m_1$ men,and $Y$ invite $l_2$ ladies and $m_2$ men.Constraints: $l_1 + m_1 = 3$,$l_2 + m_2 = 3$,$l_1 + l_2 = 3$,and $m_1 + m_2 = 3$.Possible cases $(l_1, m_1)$ for $X$ and $(l_2, m_2)$ for $Y$ are:Case $1$: $l_1=3, m_1=0$ and $l_2=0, m_2=3$. Ways: $\binom{4}{3}\binom{3}{0} 	imes \binom{3}{0}\binom{4}{3} = 4 	imes 4 = 16$.Case $2$: $l_1=2, m_1=1$ and $l_2=1, m_2=2$. Ways: $\binom{4}{2}\binom{3}{1} 	imes \binom{3}{1}\binom{4}{2} = 18 	imes 18 = 324$.Case $3$: $l_1=1, m_1=2$ and $l_2=2, m_2=1$. Ways: $\binom{4}{1}\binom{3}{2} 	imes \binom{3}{2}\binom{4}{1} = 12 	imes 12 = 144$.Case $4$: $l_1=0, m_1=3$ and $l_2=3, m_2=0$. Ways: $\binom{4}{0}\binom{3}{3} 	imes \binom{3}{3}\binom{4}{0} = 1 	imes 1 = 1$.Total ways $= 16 + 324 + 144 + 1 = 485$.

Similar Questions

For a set of $5$ true-or-false questions,no student has written all the correct answers,and no $2$ students have given the same sequence of answers. What is the maximum number of students in the class,for this to be possible?

The number of values of $r$ satisfying $^{69}C_{3r-1} - ^{69}C_{r^2} = ^{69}C_{r^2-1} - ^{69}C_{3r}$ is:

$A$ person is permitted to select at least one and at most $n$ coins from a collection of $(2n + 1)$ distinct coins. If the total number of ways in which he can select coins is $255$,then $n$ equals

Let $T_n$ be the number of all possible triangles formed by joining vertices of an $n$-sided regular polygon. If $T_{n+1} - T_n = 10$,then the value of $n$ is:

If there are $6$ periods in each working day of a school,in how many ways can one arrange $5$ subjects such that each subject is allowed at least $1$ period?

Vedclass Test Series

Exam Paper Generator

Online Exam Module